#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
int prim(ll x)
{
	for(ll i = 2;i*i<x;i++)
	{
		if(x%i==0) return 0; 
	}
	return 1;
}
void judge(ll n)
{
	for(ll i = 2;i<=n/2;i++)
	{
		if(prim(i)&&prim(n-i))
		{
			printf("%d %d\n",i,n-i);
			return ;
		}
	}
}
int main()
{
	int t;
	scanf("%d",&t);
	int cnt = 0;
	while(t--)
	{
		ll n;
		scanf("%lld",&n);
		if(n<=11) printf("Case %d: IMPOSSIBLE\n",++cnt);
		else
		{
			if(n%2)
			{
				n -= 9;
				printf("Case %d: 2 2 2 3 ",++cnt);
			}
			else 
			{
				n -= 8;
				printf("Case %d: 2 2 2 2 ",++cnt);
			}
			judge(n);
		}	
	}
}
